TEST CLUSTER SELECTION USING COVER COEFFICIENTS
نویسندگان
چکیده
منابع مشابه
Variable Selection in a GPU Cluster Using Delta Test
The work presented in this paper consists in an adaptation of a Genetic Algorithm (GA) to perform variable selection in an heterogeneous cluster where the nodes are themselves clusters of GPUs. Due to this heterogeneity, several mechanisms to perform a load balance will be discussed as well as the optimization of the fitness function to take advantage of the GPUs available. The algorithm will b...
متن کاملCluster analysis using different correlation coefficients
Partitioning objects into closely related groups that have different states allows to understand the underlying structure in the data set treated. Different kinds of similarity measure with clustering algorithms are commonly used to find an optimal clustering or closely akin to original clustering. Using shrinkage-based and rank-based correlation coefficients, which are known to be robust, the ...
متن کاملSelection differentials and selection coefficients.
Proof is offered that s approximately ig for all forms of selection where fitness is a nondecreasing function of a normally distributed phenotype (called fitness potential); s is selection coefficient, i is standard selection differential, and g is standard differential effect of a locus genotype.Evidence is presented that the cost of selection does not limit genic polymorphism; that truncation...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملRandomized Adaptive Test Cover
In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Engineering
سال: 2015
ISSN: 1925-7902
DOI: 10.2316/journal.213.2015.4.213-1071